SOS rule formats for idempotent terms and idempotent unary operators
نویسندگان
چکیده
منابع مشابه
SOS Rule Formats for Idempotent Terms and Idempotent Unary Operators
A unary operator f is idempotent if the equation f(x) = f(f(x)) holds. On the other end, an element a of an algebra is said to be an idempotent for a binary operator if a = a a. This paper presents a rule format for Structural Operational Semantics that guarantees that a unary operator be idempotent modulo bisimilarity. The proposed rule format relies on a companion one ensuring that certain te...
متن کاملIdempotent and co-idempotent stack filters and min-max operators
Viewing the elements of R as images f with pixels i∈ S of grey-scale value f(i) motivates the study of certain nonlinear operators :R → R . For translation invariant (called stack #lters in the signal processing literature) we derive the #rst necessary and su1cient condition for idempotency which can be tested in polynomial time. Various related properties can be tested in polynomial time as we...
متن کاملIntroduction to Asymptotically Idempotent Aggregation Operators
This paper deals with aggregation operators. A new class of aggregation operators, called asymptotically idempotent, is introduced. A generalization of the basic notion of aggregation operator is provided, with an in-depth discussion of the notion of idempotency. Some general contruction methods of commutative, asymptotically idempotent aggregation operators admitting a neutral element are illu...
متن کاملFully idempotent and coidempotent modules
In this paper, the notion of fully idempotent modules is defined and it is shown that this notion inherits most of the essential properties of the usual notion of von Neumann's regular rings. Furthermore, we introduce the dual notion of fully idempotent modules (that is, fully coidempotent modules) and investigate some properties of this class of modules.
متن کاملA Hierarchy of SOS Rule Formats
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [62]. Subsequently, the format of SOS rules became the object of study. Using so-called Transition System Specifications (TSS’s) several authors syntactically restricted the format of rules and showed several useful prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2014
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2013.07.003